Constrained Clustering Using SAT
نویسندگان
چکیده
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés. Constrained Clustering using SAT Jean-Philippe Metivier, Patrice Boizumault, Bruno Crémilleux, Medhi Khiari, Samir Loudni
منابع مشابه
Repeated Record Ordering for Constrained Size Clustering
One of the main techniques used in data mining is data clustering, which has many applications in computer science, biology, and social sciences. Constrained clustering is a type of clustering in which side information provided by the user is incorporated into current clustering algorithms. One of the well researched constrained clustering algorithms is called microaggregation. In a microaggreg...
متن کاملA SAT-based Framework for Efficient Constrained Clustering
The area of clustering under constraints has recently received much attention in the data mining community. However, most work involves adding constraints to existing algorithms which, although being quite pragmatic, raises several difficulties. Examples of these difficulties include creating intractable constraint satisfaction sub-problems and constrained clustering algorithms that are easily ...
متن کاملUsing Greedy Clustering Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands
Using Greedy Clustering Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands Abstract In this paper, the capacitated location routing problem with fuzzy demands (CLRP_FD) is considered. In CLRP_FD, facility location problem (FLP) and vehicle routing problem (VRP) are observed simultaneously. Indeed the vehicles and the depots have a predefined capacity to serve the customerst...
متن کاملSolving Satisfiability using Decomposition and the Most Constrained Subproblem (Preliminary Report)
In this paper we provide SAT-solving procedures that use the idea of decomposition together with the heuristic of solving the most constrained subproblem first. We present two approaches. We provide an algorithm to find the most constrained subproblem of a propositional SAT problem in polynomial time. We use this algorithm iteratively to decompose a SAT problem into partitions. We also provide ...
متن کاملCost-optimal constrained correlation clustering via weighted partial Maximum Satisfiability
Integration of the fields of constraint solving and data mining and machine learning has recently beenidentified within the AI community as an important research direction with high potential. This work con-tributes to this direction by providing a first study on the applicability of state-of-the-art Boolean optimiza-tion procedures to cost-optimal correlation clustering under c...
متن کامل